ReP USP - Resultado da busca

Relatorio tecnico
The inferential complexity of credal networks (2006)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Unidade: EP
Subjects: INFERÊNCIA, PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The inferential complexity of credal networks. . São Paulo: EPUSP. Disponível em: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf. Acesso em: 12 maio 2024. , 2006
APA
Campos, C. P. de, & Cozman, F. G. (2006). The inferential complexity of credal networks. São Paulo: EPUSP. Recuperado de https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
NLM
Campos CP de, Cozman FG. The inferential complexity of credal networks [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
Vancouver
Campos CP de, Cozman FG. The inferential complexity of credal networks [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
Trabalho de evento
The inferential complexity of bayesian and credal networks (2005)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: IJICAI-05 : proceedings. Conference titles: International Joint Conference Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The inferential complexity of bayesian and credal networks. 2005, Anais.. Edinburgh: University of Edinburgh, 2005. Disponível em: http://www.ijcai.org/papers/0841.pdf. Acesso em: 12 maio 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2005). The inferential complexity of bayesian and credal networks. In IJICAI-05 : proceedings. Edinburgh: University of Edinburgh. Recuperado de http://www.ijcai.org/papers/0841.pdf
NLM
Campos CP de, Cozman FG. The inferential complexity of bayesian and credal networks [Internet]. IJICAI-05 : proceedings. 2005 ;[citado 2024 maio 12 ] Available from: http://www.ijcai.org/papers/0841.pdf
Vancouver
Campos CP de, Cozman FG. The inferential complexity of bayesian and credal networks [Internet]. IJICAI-05 : proceedings. 2005 ;[citado 2024 maio 12 ] Available from: http://www.ijcai.org/papers/0841.pdf
Trabalho de evento
Testing MCMC algorithms with randomly generated bayesian networks (2002)
Ide, Jaime Shinsuke; Cozman, Fabio Gagliardi
Source: SBIA 2002. Conference titles: Brazilian Symposium on Artificial Intelligence. Unidade: EP
Subjects: REDES DE COMPUTADORES, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Testing MCMC algorithms with randomly generated bayesian networks. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf. Acesso em: 12 maio 2024.
APA
Ide, J. S., & Cozman, F. G. (2002). Testing MCMC algorithms with randomly generated bayesian networks. In SBIA 2002. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
NLM
Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
Vancouver
Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
Trabalho de evento
Strong probabilistic planning (2008)
Pereira, Silvio do Lago; Barros, Leliane Nunes de ; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: Mexican International Conference on Artificial Intelligence - MICAI. Unidades: IME, EP
Subjects: PROCESSOS DE MARKOV, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PEREIRA, Silvio do Lago e BARROS, Leliane Nunes de e COZMAN, Fabio Gagliardi. Strong probabilistic planning. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-88636-5_61. Acesso em: 12 maio 2024.
APA
Pereira, S. do L., Barros, L. N. de, & Cozman, F. G. (2008). Strong probabilistic planning. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-88636-5_61
NLM
Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 maio 12 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
Vancouver
Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 maio 12 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
Relatorio tecnico
Splitting the unsupervised and supervised components of semi-supervised learning (2006)
Oliveira, Clayton Silva
Unidade: EP
Subjects: APRENDIZADO COMPUTACIONAL, INTELIGÊNCIA ARTIFICIAL, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OLIVEIRA, Clayton Silva. Splitting the unsupervised and supervised components of semi-supervised learning. . São Paulo: EPUSP. Disponível em: https://repositorio.usp.br/directbitstream/4b7726ce-7d02-4523-998e-a543d81cccbb/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf. Acesso em: 12 maio 2024. , 2006
APA
Oliveira, C. S. (2006). Splitting the unsupervised and supervised components of semi-supervised learning. São Paulo: EPUSP. Recuperado de https://repositorio.usp.br/directbitstream/4b7726ce-7d02-4523-998e-a543d81cccbb/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
NLM
Oliveira CS. Splitting the unsupervised and supervised components of semi-supervised learning [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/4b7726ce-7d02-4523-998e-a543d81cccbb/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
Vancouver
Oliveira CS. Splitting the unsupervised and supervised components of semi-supervised learning [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/4b7726ce-7d02-4523-998e-a543d81cccbb/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
Relatorio tecnico
Splitting the unsupervised and supervised components of semi-supervised learning (2006)
Oliveira, Clayton Silva; Cozman, Fabio Gagliardi
Unidade: EP
Subjects: APRENDIZADO COMPUTACIONAL, INTELIGÊNCIA ARTIFICIAL, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OLIVEIRA, Clayton Silva e COZMAN, Fabio Gagliardi. Splitting the unsupervised and supervised components of semi-supervised learning. . São Paulo: EPUSP. Disponível em: https://repositorio.usp.br/directbitstream/05d3a0bd-73d9-406e-9c68-518455618efa/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf. Acesso em: 12 maio 2024. , 2006
APA
Oliveira, C. S., & Cozman, F. G. (2006). Splitting the unsupervised and supervised components of semi-supervised learning. São Paulo: EPUSP. Recuperado de https://repositorio.usp.br/directbitstream/05d3a0bd-73d9-406e-9c68-518455618efa/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
NLM
Oliveira CS, Cozman FG. Splitting the unsupervised and supervised components of semi-supervised learning [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/05d3a0bd-73d9-406e-9c68-518455618efa/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
Vancouver
Oliveira CS, Cozman FG. Splitting the unsupervised and supervised components of semi-supervised learning [Internet]. 2006 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/05d3a0bd-73d9-406e-9c68-518455618efa/Cozman-2006-splitting%20the%20unsupervised%20and%20supervised%20components-BT-PMR-0627.pdf
Trabalho de evento
Set-based variational methods in credal networks: the SV2U algorithm (2005)
Ide, Jaime Shinsuke; Cozman, Fabio Gagliardi
Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação. Unidade: EP
Subjects: REDES NEURAIS, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Set-based variational methods in credal networks: the SV2U algorithm. 2005, Anais.. São Paulo: Sonopress-Rimo, 2005. Disponível em: https://repositorio.usp.br/directbitstream/7e7aa7df-a8d8-4e73-90db-1a178c9d8404/Cozman-2005-Set-based%20variational%20methods%20in%20credal%20networks.pdf. Acesso em: 12 maio 2024.
APA
Ide, J. S., & Cozman, F. G. (2005). Set-based variational methods in credal networks: the SV2U algorithm. In Anais. São Paulo: Sonopress-Rimo. Recuperado de https://repositorio.usp.br/directbitstream/7e7aa7df-a8d8-4e73-90db-1a178c9d8404/Cozman-2005-Set-based%20variational%20methods%20in%20credal%20networks.pdf
NLM
Ide JS, Cozman FG. Set-based variational methods in credal networks: the SV2U algorithm [Internet]. Anais. 2005 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/7e7aa7df-a8d8-4e73-90db-1a178c9d8404/Cozman-2005-Set-based%20variational%20methods%20in%20credal%20networks.pdf
Vancouver
Ide JS, Cozman FG. Set-based variational methods in credal networks: the SV2U algorithm [Internet]. Anais. 2005 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/7e7aa7df-a8d8-4e73-90db-1a178c9d8404/Cozman-2005-Set-based%20variational%20methods%20in%20credal%20networks.pdf
Relatorio tecnico
Selecting exact and approximate algorithms in decomposed bayesian networks (2003)
Ramos, Fabio Tozeto; Cozman, Fabio Gagliardi
Unidade: EP
Subjects: REDES DE COMPUTADORES, PROBABILIDADE APLICADA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAMOS, Fabio Tozeto e COZMAN, Fabio Gagliardi. Selecting exact and approximate algorithms in decomposed bayesian networks. . São Paulo: EPUSP. Disponível em: https://repositorio.usp.br/directbitstream/07cc4847-9f79-4908-9491-3bd2e1c0240e/Cozman-2003-selecting%20exact-BT-PMR-0325.pdf. Acesso em: 12 maio 2024. , 2003
APA
Ramos, F. T., & Cozman, F. G. (2003). Selecting exact and approximate algorithms in decomposed bayesian networks. São Paulo: EPUSP. Recuperado de https://repositorio.usp.br/directbitstream/07cc4847-9f79-4908-9491-3bd2e1c0240e/Cozman-2003-selecting%20exact-BT-PMR-0325.pdf
NLM
Ramos FT, Cozman FG. Selecting exact and approximate algorithms in decomposed bayesian networks [Internet]. 2003 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/07cc4847-9f79-4908-9491-3bd2e1c0240e/Cozman-2003-selecting%20exact-BT-PMR-0325.pdf
Vancouver
Ramos FT, Cozman FG. Selecting exact and approximate algorithms in decomposed bayesian networks [Internet]. 2003 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/07cc4847-9f79-4908-9491-3bd2e1c0240e/Cozman-2003-selecting%20exact-BT-PMR-0325.pdf
Trabalho de evento
Selecting exact and approximate algorithms in decomposed bayesian networks (2002)
Ramos, Fabio Tozeto; Cozman, Fabio Gagliardi
Source: Workcomp'2002 : anais. Conference titles: Workshop de Computação. Unidade: EP
Subjects: REDES DE COMPUTADORES, PROBABILIDADE APLICADA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAMOS, Fabio Tozeto e COZMAN, Fabio Gagliardi. Selecting exact and approximate algorithms in decomposed bayesian networks. 2002, Anais.. São José dos Campos: Instituto Tecnologico de Aeronautica, 2002. Disponível em: https://repositorio.usp.br/directbitstream/814f333f-9ae3-4349-8b92-79a62570f9fa/Cozman-2002-Selecting%20exact%20and%20approximate%20algorithms%20in.pdf. Acesso em: 12 maio 2024.
APA
Ramos, F. T., & Cozman, F. G. (2002). Selecting exact and approximate algorithms in decomposed bayesian networks. In Workcomp'2002 : anais. São José dos Campos: Instituto Tecnologico de Aeronautica. Recuperado de https://repositorio.usp.br/directbitstream/814f333f-9ae3-4349-8b92-79a62570f9fa/Cozman-2002-Selecting%20exact%20and%20approximate%20algorithms%20in.pdf
NLM
Ramos FT, Cozman FG. Selecting exact and approximate algorithms in decomposed bayesian networks [Internet]. Workcomp'2002 : anais. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/814f333f-9ae3-4349-8b92-79a62570f9fa/Cozman-2002-Selecting%20exact%20and%20approximate%20algorithms%20in.pdf
Vancouver
Ramos FT, Cozman FG. Selecting exact and approximate algorithms in decomposed bayesian networks [Internet]. Workcomp'2002 : anais. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/814f333f-9ae3-4349-8b92-79a62570f9fa/Cozman-2002-Selecting%20exact%20and%20approximate%20algorithms%20in.pdf
Parte de monografia/livro
Risks of semi-supervised learning: how unlabeled data can degrade performance of generative classifiers (2006)
Cozman, Fabio Gagliardi ; Cohen, Ira
Source: Semi-supervised learning. Unidade: EP
Subjects: APRENDIZADO COMPUTACIONAL, INTELIGÊNCIA ARTIFICIAL, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e COHEN, Ira. Risks of semi-supervised learning: how unlabeled data can degrade performance of generative classifiers. Semi-supervised learning. Tradução . Cambridge: MIT Press, 2006. . Disponível em: https://repositorio.usp.br/directbitstream/df0ebf0c-1d85-4d79-9dd0-d1048287d165/Cozman-2006-risks%20of%20semi%20supervised%20learning.pdf. Acesso em: 12 maio 2024.
APA
Cozman, F. G., & Cohen, I. (2006). Risks of semi-supervised learning: how unlabeled data can degrade performance of generative classifiers. In Semi-supervised learning. Cambridge: MIT Press. Recuperado de https://repositorio.usp.br/directbitstream/df0ebf0c-1d85-4d79-9dd0-d1048287d165/Cozman-2006-risks%20of%20semi%20supervised%20learning.pdf
NLM
Cozman FG, Cohen I. Risks of semi-supervised learning: how unlabeled data can degrade performance of generative classifiers [Internet]. In: Semi-supervised learning. Cambridge: MIT Press; 2006. [citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/df0ebf0c-1d85-4d79-9dd0-d1048287d165/Cozman-2006-risks%20of%20semi%20supervised%20learning.pdf
Vancouver
Cozman FG, Cohen I. Risks of semi-supervised learning: how unlabeled data can degrade performance of generative classifiers [Internet]. In: Semi-supervised learning. Cambridge: MIT Press; 2006. [citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/df0ebf0c-1d85-4d79-9dd0-d1048287d165/Cozman-2006-risks%20of%20semi%20supervised%20learning.pdf
Trabalho de evento
Randon generation of bayesian networks (2002)
Ide, Jaime Shinsuke; Cozman, Fabio Gagliardi
Source: SEBIA 2002. Conference titles: Brazilian Symposium on Artificial Intelligence. Unidade: EP
Subjects: REDES DE COMPUTADORES, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Randon generation of bayesian networks. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf. Acesso em: 12 maio 2024.
APA
Ide, J. S., & Cozman, F. G. (2002). Randon generation of bayesian networks. In SEBIA 2002. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf
NLM
Ide JS, Cozman FG. Randon generation of bayesian networks [Internet]. SEBIA 2002. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf
Vancouver
Ide JS, Cozman FG. Randon generation of bayesian networks [Internet]. SEBIA 2002. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf
Trabalho de evento
Propositional and relational bayesian networks associated with imprecise and qualitative probabilistic assessments (2004)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de; Ide, Jaime Shinsuke; Rocha, José Carlos Ferreira da
Source: UAI 2004 : proceedings. Conference titles: Conference on Uncertainty in Artifical Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi et al. Propositional and relational bayesian networks associated with imprecise and qualitative probabilistic assessments. 2004, Anais.. Arlington: AUAI Press, 2004. Disponível em: https://repositorio.usp.br/directbitstream/3f5da3ff-b289-467b-8bfa-649181a31a14/Cozman-2004-Propositional%20and%20relational%20bayesian%20networks%20associated.pdf. Acesso em: 12 maio 2024.
APA
Cozman, F. G., Campos, C. P. de, Ide, J. S., & Rocha, J. C. F. da. (2004). Propositional and relational bayesian networks associated with imprecise and qualitative probabilistic assessments. In UAI 2004 : proceedings. Arlington: AUAI Press. Recuperado de https://repositorio.usp.br/directbitstream/3f5da3ff-b289-467b-8bfa-649181a31a14/Cozman-2004-Propositional%20and%20relational%20bayesian%20networks%20associated.pdf
NLM
Cozman FG, Campos CP de, Ide JS, Rocha JCF da. Propositional and relational bayesian networks associated with imprecise and qualitative probabilistic assessments [Internet]. UAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/3f5da3ff-b289-467b-8bfa-649181a31a14/Cozman-2004-Propositional%20and%20relational%20bayesian%20networks%20associated.pdf
Vancouver
Cozman FG, Campos CP de, Ide JS, Rocha JCF da. Propositional and relational bayesian networks associated with imprecise and qualitative probabilistic assessments [Internet]. UAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/3f5da3ff-b289-467b-8bfa-649181a31a14/Cozman-2004-Propositional%20and%20relational%20bayesian%20networks%20associated.pdf
Trabalho de evento
Planning under risk and knightian uncertainty (2007)
Trevizan, Felipe Werndl; Cozman, Fabio Gagliardi ; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidades: EP, IME
Subjects: PROCESSOS DE MARKOV, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TREVIZAN, Felipe Werndl e COZMAN, Fabio Gagliardi e BARROS, Leliane Nunes de. Planning under risk and knightian uncertainty. 2007, Anais.. New York: ACM, 2007. Disponível em: https://dl.acm.org/doi/10.5555/1625275.1625602. Acesso em: 12 maio 2024.
APA
Trevizan, F. W., Cozman, F. G., & Barros, L. N. de. (2007). Planning under risk and knightian uncertainty. In Proceedings. New York: ACM. doi:10.5555/1625275.1625602
NLM
Trevizan FW, Cozman FG, Barros LN de. Planning under risk and knightian uncertainty [Internet]. Proceedings. 2007 ;[citado 2024 maio 12 ] Available from: https://dl.acm.org/doi/10.5555/1625275.1625602
Vancouver
Trevizan FW, Cozman FG, Barros LN de. Planning under risk and knightian uncertainty [Internet]. Proceedings. 2007 ;[citado 2024 maio 12 ] Available from: https://dl.acm.org/doi/10.5555/1625275.1625602
Trabalho de evento
Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities (2005)
Kikuti, Daniel; Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de
Source: Proceedings. Conference titles: IJCAI Workshop on Advances on Preference Handling. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KIKUTI, Daniel e COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities. 2005, Anais.. Edinburgh: University of Edinburgh, 2005. Disponível em: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf. Acesso em: 12 maio 2024.
APA
Kikuti, D., Cozman, F. G., & Campos, C. P. de. (2005). Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities. In Proceedings. Edinburgh: University of Edinburgh. Recuperado de https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
NLM
Kikuti D, Cozman FG, Campos CP de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities [Internet]. Proceedings. 2005 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
Vancouver
Kikuti D, Cozman FG, Campos CP de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities [Internet]. Proceedings. 2005 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
Trabalho de evento-anais periodico
Loopy propagation in a probabilistic description logic (2008)
Cozman, Fabio Gagliardi ; Polastro, Rodrigo Bellizia
Source: Lecture Notes in Artificial Intelligence. Conference titles: International Conference on Scalable Uncertainty Management. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE, ALGORITMOS, INFERÊNCIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e POLASTRO, Rodrigo Bellizia. Loopy propagation in a probabilistic description logic. Lecture Notes in Artificial Intelligence. Heidelberg: Springer-Verlag. Disponível em: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf. Acesso em: 12 maio 2024. , 2008
APA
Cozman, F. G., & Polastro, R. B. (2008). Loopy propagation in a probabilistic description logic. Lecture Notes in Artificial Intelligence. Heidelberg: Springer-Verlag. Recuperado de https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf
NLM
Cozman FG, Polastro RB. Loopy propagation in a probabilistic description logic [Internet]. Lecture Notes in Artificial Intelligence. 2008 ; 5291 120-133.[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf
Vancouver
Cozman FG, Polastro RB. Loopy propagation in a probabilistic description logic [Internet]. Lecture Notes in Artificial Intelligence. 2008 ; 5291 120-133.[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf
Trabalho de evento
Local computation in credal networks (2004)
Cozman, Fabio Gagliardi
Source: ECAI 2004 : proceedings. Conference titles: European Conference on Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, REDES NEURAIS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi. Local computation in credal networks. 2004, Anais.. Amsterdam: IOS Press, 2004. Disponível em: https://repositorio.usp.br/directbitstream/927489a4-7620-4325-98c2-ecc1d4696a29/Cozman-2004-Local%20computation%20in%20credal%20networks.pdf. Acesso em: 12 maio 2024.
APA
Cozman, F. G. (2004). Local computation in credal networks. In ECAI 2004 : proceedings. Amsterdam: IOS Press. Recuperado de https://repositorio.usp.br/directbitstream/927489a4-7620-4325-98c2-ecc1d4696a29/Cozman-2004-Local%20computation%20in%20credal%20networks.pdf
NLM
Cozman FG. Local computation in credal networks [Internet]. ECAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/927489a4-7620-4325-98c2-ecc1d4696a29/Cozman-2004-Local%20computation%20in%20credal%20networks.pdf
Vancouver
Cozman FG. Local computation in credal networks [Internet]. ECAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/927489a4-7620-4325-98c2-ecc1d4696a29/Cozman-2004-Local%20computation%20in%20credal%20networks.pdf
Artigo de periodico
Link prediction using a probabilistic description logic (2013)
Luna, José Eduardo Ochoa; Revoredo, Kate; Cozman, Fabio Gagliardi
Source: Journal of the Brazilian Computer Society. Unidade: EP
Subjects: PROBABILIDADE, LÓGICA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LUNA, José Eduardo Ochoa e REVOREDO, Kate e COZMAN, Fabio Gagliardi. Link prediction using a probabilistic description logic. Journal of the Brazilian Computer Society, v. 19, p. 397-409, 2013Tradução . . Disponível em: http://link.springer.com/article/10.1007*2Fs13173-013-0108-8#page-1. Acesso em: 12 maio 2024.
APA
Luna, J. E. O., Revoredo, K., & Cozman, F. G. (2013). Link prediction using a probabilistic description logic. Journal of the Brazilian Computer Society, 19, 397-409. doi:10.1007/s13173-013-0108-8
NLM
Luna JEO, Revoredo K, Cozman FG. Link prediction using a probabilistic description logic [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 397-409.[citado 2024 maio 12 ] Available from: http://link.springer.com/article/10.1007*2Fs13173-013-0108-8#page-1
Vancouver
Luna JEO, Revoredo K, Cozman FG. Link prediction using a probabilistic description logic [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 397-409.[citado 2024 maio 12 ] Available from: http://link.springer.com/article/10.1007*2Fs13173-013-0108-8#page-1
Trabalho de evento
Inference with separately specified sets of probabilities in credal networks (2002)
Rocha, José Carlos Ferreira da; Cozman, Fabio Gagliardi
Source: UAI 2002 : proceedings. Conference titles: Conference on Uncertainty in Artificial Intelligence. Unidade: EP
Subjects: INFERÊNCIA, PROBABILIDADE APLICADA, ALGORITMOS, REDES DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROCHA, José Carlos Ferreira da e COZMAN, Fabio Gagliardi. Inference with separately specified sets of probabilities in credal networks. 2002, Anais.. San Francisco: Morgan Kaufmann Publishers, 2002. Disponível em: https://repositorio.usp.br/directbitstream/fb04d88a-efaa-47e8-a448-6028501ac0f7/Cozman-2002-Inference%20with%20separately%20specified%20sets.pdf. Acesso em: 12 maio 2024.
APA
Rocha, J. C. F. da, & Cozman, F. G. (2002). Inference with separately specified sets of probabilities in credal networks. In UAI 2002 : proceedings. San Francisco: Morgan Kaufmann Publishers. Recuperado de https://repositorio.usp.br/directbitstream/fb04d88a-efaa-47e8-a448-6028501ac0f7/Cozman-2002-Inference%20with%20separately%20specified%20sets.pdf
NLM
Rocha JCF da, Cozman FG. Inference with separately specified sets of probabilities in credal networks [Internet]. UAI 2002 : proceedings. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/fb04d88a-efaa-47e8-a448-6028501ac0f7/Cozman-2002-Inference%20with%20separately%20specified%20sets.pdf
Vancouver
Rocha JCF da, Cozman FG. Inference with separately specified sets of probabilities in credal networks [Internet]. UAI 2002 : proceedings. 2002 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/fb04d88a-efaa-47e8-a448-6028501ac0f7/Cozman-2002-Inference%20with%20separately%20specified%20sets.pdf
Artigo de periodico
Inference in credal networks: branch-and-bound methods and the A/R+ algorithm (2005)
Rocha, José Carlos Ferreira da; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidade: EP
Subjects: INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL, MÉTODOS GRÁFICOS, REDES NEURAIS, PROBABILIDADE, MODELOS MATEMÁTICOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROCHA, José Carlos Ferreira da e COZMAN, Fabio Gagliardi. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm. International Journal of Approximate Reasoning, v. 39, n. 2-3, p. 279-296, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2004.10.009. Acesso em: 12 maio 2024.
APA
Rocha, J. C. F. da, & Cozman, F. G. (2005). Inference in credal networks: branch-and-bound methods and the A/R+ algorithm. International Journal of Approximate Reasoning, 39( 2-3), 279-296. doi:10.1016/j.ijar.2004.10.009
NLM
Rocha JCF da, Cozman FG. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm [Internet]. International Journal of Approximate Reasoning. 2005 ; 39( 2-3): 279-296.[citado 2024 maio 12 ] Available from: https://doi.org/10.1016/j.ijar.2004.10.009
Vancouver
Rocha JCF da, Cozman FG. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm [Internet]. International Journal of Approximate Reasoning. 2005 ; 39( 2-3): 279-296.[citado 2024 maio 12 ] Available from: https://doi.org/10.1016/j.ijar.2004.10.009
Trabalho de evento
Inference in credal networks using multilinear programming (2004)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: ECAI 2004 : proceedings. Conference titles: European Conference on Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, REDES NEURAIS, ALGORITMOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Inference in credal networks using multilinear programming. 2004, Anais.. Amsterdam: IOS Press, 2004. Disponível em: https://repositorio.usp.br/directbitstream/1f736784-5212-4cf6-9b9a-637ede61893f/Cozman-2004-Inference%20in%20credal%20networks%20using%20multilinear.pdf. Acesso em: 12 maio 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2004). Inference in credal networks using multilinear programming. In ECAI 2004 : proceedings. Amsterdam: IOS Press. Recuperado de https://repositorio.usp.br/directbitstream/1f736784-5212-4cf6-9b9a-637ede61893f/Cozman-2004-Inference%20in%20credal%20networks%20using%20multilinear.pdf
NLM
Campos CP de, Cozman FG. Inference in credal networks using multilinear programming [Internet]. ECAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/1f736784-5212-4cf6-9b9a-637ede61893f/Cozman-2004-Inference%20in%20credal%20networks%20using%20multilinear.pdf
Vancouver
Campos CP de, Cozman FG. Inference in credal networks using multilinear programming [Internet]. ECAI 2004 : proceedings. 2004 ;[citado 2024 maio 12 ] Available from: https://repositorio.usp.br/directbitstream/1f736784-5212-4cf6-9b9a-637ede61893f/Cozman-2004-Inference%20in%20credal%20networks%20using%20multilinear.pdf

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Indexado em